An optimal deterministic algorithm for online b-matching
نویسندگان
چکیده
منابع مشابه
An Optimal Deterministic Algorithm for Online b-Matching
We study the online unweighted b-matching problem where at most b 1 requests can be matched to any server site. We present a deter-ministic algorithm Balance whose competitive ratio is 1? 1 (1+ 1 b) b. We show that the competitive ratio of every deterministic online algorithm is at least 1 ? 1 (1+ 1 b) b. Hence, Balance is optimally competitive, including low order terms. For large b, the compe...
متن کاملOn an Optimal Deterministic Algorithm for SAT
J. Kraj cek and P. Pudll ak proved that an almost optimal deterministic algorithm for TAUT exists if and only if there exists a p-optimal proof system for TAUT. In this paper we prove that an almost optimal deterministic algorithm for SAT exists if and only if there exists a p-optimal proof system for SAT. Combining Kraj cek and Pudll ak's result with our result we show that an optimal determin...
متن کاملAn optimal parallel matching algorithm for cographs
The class of cographs, or complement-reducible graphs, arises naturally in many different areas of applied mathematics and computer science. We show that the problem of finding a maximum matching in a cograph can be solved optimally in parallel by reducing it to parenthesis matching. With an $n$-vertex cograph $G$ represented by its parse tree as input, our algorithm finds a maximum matching in...
متن کاملAn Efficient Adaptive Boundary Matching Algorithm for Video Error Concealment
Sending compressed video data in error-prone environments (like the Internet and wireless networks) might cause data degradation. Error concealment techniques try to conceal the received data in the decoder side. In this paper, an adaptive boundary matching algorithm is presented for recovering the damaged motion vectors (MVs). This algorithm uses an outer boundary matching or directional tempo...
متن کاملAn Optimal Algorithm for Online Square Detection
A square is the concatenation of two identical non-empty strings. Let S be the input string which is given character by character. Let m be the (unknown) smallest integer such that the m-th prefix of S contains a square. The online square detection problem is to determine m as soon as the m-th character of S is read. The best previously known algorithm of the online square detection problem, du...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Theoretical Computer Science
سال: 2000
ISSN: 0304-3975
DOI: 10.1016/s0304-3975(99)00140-1